Purely equivalential propositional formulas in the intermediate Godel-Dummett logic

نویسنده

  • Katarzyna Slomczynska
چکیده

. 1 Preliminaries Consider the variety Eω generated by the algebra ω := (N, ·), where i · j := max (i, j) for i 6= j, and i · j := 1 for i = j, i, j ∈ N1. These variety is a subvariety of the variety of equivalential algebras E . By an equivalential algebra we mean a grupoid A = (A,↔) that is a subreduct of a Brouwerian semilattice (or, equivalently, a Heyting algebra) with the operation ↔ given by x ↔ y = (x → y) ∧ (y → x). This notion was introduced Received 11 January 2006

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Equivalential Logics (After 25 Years of Investigations)

The notion of equivalential logic is due to Tadeusz Prucnal and Andrzej Wroński. The short note “An algebraic characterization of the notion of structural completeness” appeared in 1974 in Bulletin of the Section of Logic, Vol. 3, 30-33. The work dealt mainly with structural completeness, the property of deductive systems which was systematically investigated in Poland in the beginning of the 7...

متن کامل

Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge

In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of non-invertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which...

متن کامل

Gödel-Dummett Predicate Logics and Axioms of Prenexability

Gödel-Dummett logic in general is a multi-valued logic where a truth value of a formula can be any number from the real interval [0, 1] and where implication → is evaluated via the Gödel implication function. As to truth values, 0 (falsity) and 1 (truth) are the extremal truth values whereas the remaining truth values are called intermediate. Gödel implication function ⇒ is defined as follows: ...

متن کامل

Algebraizability and Beth’s Theorem for Equivalential Logics

We provide a new approach to algebraizable logics in the sense of Blok and Pigozzi. These are finitely equivalential logics with equationally definable truth . Theorem 1 states that the truth predicate in the reduced matrices for an equivalential logic is implicitly definable iff it is explicitly definable by a conjunction of equations. This is an improved instance of Beth’s Theorem for Lω1ω. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Reports on Mathematical Logic

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2007